The free-linking task: A graph-inspired method for generating non-disjoint similarity data with food products

نویسندگان

چکیده

“Free sorting”, in which subjects are asked to sort a set of items into groups “most similar” items, is increasingly popular as technique for profiling sets foods. However, free sorting implies an unrealistic model sample similarity: that similarity purely binary (is/is not similar) and fully transitive (similarities {A, B} {B, C} imply C}). This paper proposes new method rapid testing—the “free-linking” task—that solves both problems: linking, draw graph they connect pairs samples with line if similar, according the subject’s individual criteria. simple task provides more realistic allows degrees through distance metric does require similarity. In two pilot studies spice blends (10 samples, 58 subjects) chocolate bars 63 subjects), linking evaluated compared using DISTATIS, RVb, parameters degree, transitivity, connectivity; also indicated their preferences ease-of-use tasks. studies, first dimensions DISTATIS consensus were highly comparable across tasks; however, provided discrimination three four. RVb stability was equivalent methods. Graph statistics had greater power: on average made groupings lower higher connectivity studies. did overall find easier liked it more, indicating cognitive difficulty linking. The free-linking task, therefore, robust, maps at cost panelist effort, should prove valuable alternative sensory assessment product sets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Graph-based Method for Entity Linking

In this paper, we formalize the task of finding a knowledge base entry that a given named entity mention refers to, namely entity linking, by identifying the most “important” node among the graph nodes representing the candidate entries. With the aim of ranking these entities by their “importance”, we introduce three degree-based measures of graph connectivity. Experimental results on the TACKB...

متن کامل

Generating an Indoor space routing graph using semantic-geometric method

The development of indoor Location-Based Services faces various challenges that one of which is the method of generating indoor routing graph. Due to the weaknesses of purely geometric methods for generating indoor routing graphs, a semantic-geometric method is proposed to cover the existing gaps in combining the semantic and geometric methods in this study. The proposed method uses the CityGML...

متن کامل

Generating Tuples of Free Products

Grushko’s theorem [Mat. Sb. 8 (1940) 169–182] says that any generating tuple (g1, . . . , gm) of a free product H ∗K is Nielsen-equivalent to a tuple (h1, . . . , hl, kl+1, . . . , km) with hi ∈ H and ki ∈ K for all i. The hi and ki are clearly not unique. In this paper we address the extent of this non-uniqueness.

متن کامل

DESIGNING A CURRICULUM MODEL FOR GENERAL MEDICINE WITH A COMBINED METHOD (E-LEARNING AND NON-E-LEARNING) INSPIRED BY THE AKKER MODEL: A QUALITATIVE STUDY

Background & Aims: In addition to providing health care services, medical universities have an important role in training expert and skilled manpower needed by different sections of society. In order to do so, the general medical education curriculum should be constantly reviewed and improved by eliminating the shortcomings. The aim of this study was to design a curriculum model for teaching ge...

متن کامل

Non-minimal sums of disjoint products

We re…ne a conjecture of M. O. Locks and J. M. Wilson [Reliability Engineering and System Safety 46 (1994), 283-286] regarding disjoint forms of the Abraham Reliability problem. We also present other examples of reliability problems with the interesting property that their minimal disjoint forms do not arise from the familiar tautologyM1+:::+Mn M1+(M2 M1)+(M3 M2 M1)+:::+(Mn Mn 1 ::: M1):

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Food Quality and Preference

سال: 2022

ISSN: ['0950-3293', '1873-6343']

DOI: https://doi.org/10.1016/j.foodqual.2021.104355